Lantern Slides of Diagrams, Formulæ, etc

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Realizing arithmetical formulæ

Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical realizability Realizability game Zoology Gender equality Introduction Curry-Howard Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical ...

متن کامل

Reasoning on Schemata of Formulæ

Mnacho Echenim, Nicolas Peltier. Reasoning on Schemata of Formulæ. Johan Jeuring, John A. Campbell, Jacques Carette, Gabriel Dos Reis, Petr Sojka, Makarius Wenzel, Volker Sorge. AISC 2012 Artificial Intelligence and Symbolic Computation (Part of CICM 2012), Jul 2012, Bremen, Germany. Springer, 7362, pp.310-325, 2012, Lecture Notes in Computer Science (LNCS). <10.1007/978-3-642-31374-5 21>. <hal...

متن کامل

A lantern lemma

We show that in the mapping class group of a surface any relation between Dehn twists of the form T j xT k y = M (M a multitwist) is the lantern relation, and any relation of the form (TxTy) k = M (where Tx commutes with M ) is the 2-chain relation. AMS Classification 57M07; 20F38, 57N05

متن کامل

Applications of the Lantern Identity

The purpose of this note is to unify the role of the lantern identity in the proof of several finiteness theorems. In particular, we show that for every nonnegative integer m, the vector space (over the rationals) of type m (resp. T -type m) invariants of integral homology 3-spheres are finite dimensional. These results have already been obtained by [Oh] and [GL2] respectively; our derivation h...

متن کامل

Enumeration Formulæ in Neutral Sets

We present several enumeration results holding in sets of words called neutral and which satisfy restrictive conditions on the set of possible extensions of nonempty words. These formulae concern return words and bifix codes. They generalize formulae previously known for Sturmian sets or more generally for tree sets. We also give a geometric example of this class of sets, namely the natural cod...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1946

ISSN: 0028-0836,1476-4687

DOI: 10.1038/157591c0